Finding an induced path of given parity in planar graphs in polynomial time
نویسندگان
چکیده
The problem of deciding, given a graph G and two vertices s and t, whether there exists an induced path of given parity between s and t in G is known to be NP-complete. We show how to solve the problem in O(|V (G)|) time, when the input graph is planar. We use techniques from the theory of graph minors as well as the theory of perfect graphs.
منابع مشابه
On the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کامل4:45- 5:15 Coffee Break
9:30 10:30 Paul Seymour, “Disjoint paths in tournaments” 10:30 11:00 Coffee Break 11:00 11:20 Tony Huynh, “Explicit bounds for graph minors” 11:25 11:45 Isolde Adler, “Tight bounds for linkages in planar graphs” 11:50 12:10 Michal Pilipczuk, “Jungles, bundles and fixed parameter tractability” 12:10 3:30 Lunch and discussion 3:30 3:50 Pierre Charbit, “LexBFS, structure and algorithms” 3:55 4:15 ...
متن کاملRecognizing Planar Strict Quasi-Parity Graphs
A graph is a strict-quasi parity (SQP) graph if every induced subgraph that is not a clique contains a pair of vertices with no odd chordless path between them (an``even pair''). We present an O n 3 algorithm for recognizing planar strict quasi-parity graphs, based on Wen-Lian Hsu's decomposition of planar (perfect) graphs and on the (non-algorithmic) characterization of planar minimal non-SQ...
متن کاملFinding Paths in Grids with Forbidden Transitions
A transition in a graph is a pair of adjacent edges. Given a graph G = (V,E), a set of forbidden transitions F ⊆ E × E and two vertices s, t ∈ V , we study the problem of finding a path from s to t which uses none of the forbidden transitions of F . This means that it is forbidden for the path to consecutively use two edges forming a pair in F . The study of this problem is motivated by routing...
متن کاملThe Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
A Hamiltonian cycle (path) of a graph G is a simple cycle (path) which contains all the vertices of G. The Hamiltonian cycle problem asks whether a given graph contains a Hamiltonian cycle. It is NP-complete even for 3-connected planar graphs [3, 61. However, the problem becomes polynomial-time solvable for Cconnected planar graphs: Tutte proved that such a graph necessarily contains a Hamilton...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012